Automatic quantum searching of object databases

ABSTRACT

A method includes measuring an amplitude of a state of a quantum circuit, the amplitude corresponding to a first location in an object database. In the embodiment, the method includes executing, using a classical processor and a first memory, a verification operation, responsive to measuring the amplitude, to verify a target object in the first location. In the embodiment, the method includes re-measuring a second amplitude of a second state of the quantum circuit, the second amplitude having undergone a first plurality of amplitude amplifications, the second amplitude corresponding to a second location in the object database, the second location being verified as the target object, and wherein a total number of the first plurality of amplitude amplifications being less than a square root of a set of objects in the object database.

TECHNICAL FIELD

The present invention relates generally to performing search tasks. More particularly, the present invention relates to a method for automatic quantum searching of object databases.

BACKGROUND

Hereinafter, a “Q” prefix in a word of phrase is indicative of a reference of that word or phrase in a quantum computing context unless expressly distinguished where used.

Molecules and subatomic particles follow the laws of quantum mechanics, a branch of physics that explores how the physical world works at the most fundamental levels. At this level, particles behave in strange ways, taking on more than one state at the same time, and interacting with other particles that are very far away. Quantum computing harnesses these quantum phenomena to process information.

The computers we use today are known as classical computers (also referred to herein as “conventional” computers or conventional nodes, or “CN”). A conventional computer uses a conventional processor fabricated using semiconductor materials and technology, a semiconductor memory, and a magnetic or solid-state storage device, in what is known as a Von Neumann architecture. Particularly, the processors in conventional computers are binary processors, i.e., operating on binary data represented in 1 and 0.

A quantum processor (q-processor) uses the odd nature of entangled qubit devices (compactly referred to herein as “qubit,” plural “qubits”) to perform computational tasks. In the particular realms where quantum mechanics operates, particles of matter can exist in multiple states—such as an “on” state, an “off” state, and both “on” and “off” states simultaneously. Where binary computing using semiconductor processors is limited to using just the on and off states (equivalent to 1 and 0 in binary code), a quantum processor harnesses these quantum states of matter to output signals that are usable in data computing.

Conventional computers encode information in bits. Each bit can take the value of 1 or 0. These 1s and 0s act as on/off switches that ultimately drive computer functions. Quantum computers, on the other hand, are based on qubits, which operate according to two key principles of quantum physics: superposition and entanglement. Superposition means that each qubit can represent both a 1 and a 0 at the same time. Entanglement means that qubits in a superposition can be correlated with each other in a non-classical way; that is, the state of one (whether it is a 1 or a 0 or both) can depend on the state of another, and that there is more information that can be ascertained about the two qubits when they are entangled than when they are treated individually.

Using these two principles, qubits operate as more sophisticated processors of information, enabling quantum computers to function in ways that allow them to solve difficult problems that are intractable using conventional computers. IBM has successfully constructed and demonstrated the operability of a quantum processor using superconducting qubits (IBM is a registered trademark of International Business Machines corporation in the United States and in other countries.)

The illustrative embodiments recognize that quantum processors can perform algorithms which conventional processors are incapable of performing efficiently. As an example, Grover's algorithm is a quantum algorithm for performing search tasks through unordered collections of objects. Grover's algorithm searches an object database containing a set of objects, looking for a target object with a unique property.

At the beginning of the search operation, any guess of the location of the target object is as good as any other guess. Therefore, the quantum state of the system can be expressed in a uniform superposition,

$\left. {{{\left. s \right\rangle = {\frac{1}{\sqrt{N}}\sum\limits_{x = 0}^{N - 1}}}\; }x} \right\rangle.$ The standard basis |x

is a superposition of each basis state, each basis state corresponding to an object in the object database. For example, the standard basis |x

includes a basis state for the target object |t

. Each guess of the location of the target object for the uniform superposition has the same probability, 1/N, where N is the number of objects in the object database.

Next, the search operation performs a process called amplitude amplification. The search operation performs a command to reflect the uniform superposition about a state |s′

formed by removing the target object basis state |t

from the uniform superposition |s

and rescaling the uniform superposition. The reflected state is then reflected a second time. The reflected state is reflected about the uniform superposition |s

. The two reflections produce a rotation of the initial state |s

closer to the target object state |t

. The amplitude amplification process is repeated a number of iterations to find the location of the target object. The search operation measures the final amplitude of the circuit, the final amplitude corresponding to a selected location for the target object.

The illustrative embodiments recognize that the size of the object database assists in determining the optimal number of iterations of the amplitude amplification process to perform using Grover's algorithm. The illustrative embodiments recognize that oftentimes the size of the object database is not known.

SUMMARY

The illustrative embodiments provide a method, system, and computer program product for automatic quantum searching of object databases. A method includes measuring an amplitude of a state of a quantum circuit, the amplitude corresponding to a first location in an object database. In the embodiment, the method includes executing, using a classical processor and a first memory, a verification operation, responsive to measuring the amplitude, to verify a target object in the first location.

In the embodiment, the method includes re-measuring a second amplitude of a second state of the quantum circuit, the second amplitude having undergone a first plurality of amplitude amplifications, the second amplitude corresponding to a second location in the object database, the second location being verified as the target object, and wherein a total number of the first plurality of amplitude amplifications being less than a square root of a set of objects in the object database.

In an embodiment, the method includes executing, using the classical processor and the second memory, a second verification operation, responsive to re-measuring the second amplitude, to verify the target object in the second location. In an embodiment, the method includes executing, using a quantum processor and a second memory, prior to measuring the amplitude, a search operation to return the target object in the object database, the search operation configured to amplify the amplitude.

In an embodiment, the method includes executing, using the quantum processor and the second memory, prior to re-measuring the second amplitude, a second search operation, the second search operation configured to amplify the second amplitude. In an embodiment, the amplitude has undergone a second plurality of amplitude amplifications.

In an embodiment, the method includes incrementing, responsive to failing to verify the target object in the first location, the second plurality of amplitude amplifications to generate a new plurality of amplitude amplifications. In an embodiment, the first plurality of amplitude amplifications is equal to the new plurality of amplitude amplifications.

An embodiment includes a computer usable program product. The computer usable program product includes a computer-readable storage device, and program instructions stored on the storage device.

In an embodiment, the program instructions are stored in a computer readable storage device in a data processing system, and wherein the computer usable code is transferred over a network from a remote data processing system. In an embodiment, the program instructions are stored in a computer readable storage device in a server data processing system, and wherein the computer usable code is downloaded over a network to a remote data processing system for use in a computer readable storage device associated with the remote data processing system.

An embodiment includes a computer system. The computer system includes a quantum processor, a computer-readable memory, and a computer-readable storage device, and program instructions stored on the storage device for execution by the quantum processor via the memory.

BRIEF DESCRIPTION OF THE DRAWINGS

The novel features believed characteristic of the invention are set forth in the appended claims. The invention itself, however, as well as a preferred mode of use, further objectives and advantages thereof, will best be understood by reference to the following detailed description of the illustrative embodiments when read in conjunction with the accompanying drawings, wherein:

FIG. 1 depicts a block diagram of a network of data processing systems in which illustrative embodiments may be implemented;

FIG. 2 depicts a block diagram of a data processing system in which illustrative embodiments may be implemented;

FIG. 3 depicts a block diagram of an example configuration for automatic quantum searching of object databases;

FIG. 4 depicts a block diagram of an example configuration for automatic quantum searching of object databases;

FIG. 5 depicts a flowchart of an example process for automatic quantum searching of object databases in accordance with an illustrative embodiment; and

FIG. 6 depicts a flowchart of an example process for a search operation in accordance with an illustrative embodiment.

DETAILED DESCRIPTION

The illustrative embodiments used to describe the invention generally address and solve the above-described problem of search algorithms. The illustrative embodiments provide a method for automatic quantum searching of object databases.

For the clarity of the description, and without implying any limitation thereto, the illustrative embodiments are described using some example configurations. From this disclosure, those of ordinary skill in the art will be able to conceive many alterations, adaptations, and modifications of a described configuration for achieving a described purpose, and the same are contemplated within the scope of the illustrative embodiments.

Furthermore, simplified diagrams of the data processing environments are used in the figures and the illustrative embodiments. In an actual computing environment, additional structures or component that are not shown or described herein, or structures or components different from those shown but for a similar function as described herein may be present without departing the scope of the illustrative embodiments.

Furthermore, the illustrative embodiments are described with respect to specific actual or hypothetical components only as examples. The steps described by the various illustrative embodiments can be adapted for automatic quantum searching of object databases using a variety of components that can be purposed or repurposed to provide a described function within a data processing environment, and such adaptations are contemplated within the scope of the illustrative embodiments.

The illustrative embodiments are described with respect to certain types of steps, applications, quantum logic gates, and data processing environments only as examples. Any specific manifestations of these and other similar artifacts are not intended to be limiting to the invention. Any suitable manifestation of these and other similar artifacts can be selected within the scope of the illustrative embodiments.

The examples in this disclosure are used only for the clarity of the description and are not limiting to the illustrative embodiments. Any advantages listed herein are only examples and are not intended to be limiting to the illustrative embodiments. Additional or different advantages may be realized by specific illustrative embodiments. Furthermore, a particular illustrative embodiment may have some, all, or none of the advantages listed above.

With reference to the figures and in particular with reference to FIGS. 1 and 2, these figures are example diagrams of data processing environments in which illustrative embodiments may be implemented. FIGS. 1 and 2 are only examples and are not intended to assert or imply any limitation with regard to the environments in which different embodiments may be implemented. A particular implementation may make many modifications to the depicted environments based on the following description.

FIG. 1 depicts a block diagram of a network of data processing systems in which illustrative embodiments may be implemented. Data processing environment 100 is a network of computers in which the illustrative embodiments may be implemented. Data processing environment 100 includes network 102. Network 102 is the medium used to provide communications links between various devices and computers connected together within data processing environment 100. Network 102 may include connections, such as wire, wireless communication links, or fiber optic cables.

Clients or servers are only example roles of certain data processing systems connected to network 102 and are not intended to exclude other configurations or roles for these data processing systems. Server 104 couples to network 102 along with storage unit 108. Server 104 is a conventional data processing system. Quantum processing system 140 couples to network 102. Quantum processing system 140 is a quantum data processing system. Software applications may execute on any quantum data processing system in data processing environment 100. Any software application described as executing in quantum processing system 140 in FIG. 1 can be configured to execute in another quantum data processing system in a similar manner. Any data or information stored or produced in quantum processing system 140 in FIG. 1 can be configured to be stored or produced in another quantum data processing system in a similar manner. A quantum data processing system, such as quantum processing system 140, may contain data and may have software applications or software tools executing quantum computing processes thereon.

Clients 110, 112, and 114 are also coupled to network 102. A conventional data processing system, such as server 104, or client 110, 112, or 114 may contain data and may have software applications or software tools executing conventional computing processes thereon.

Only as an example, and without implying any limitation to such architecture, FIG. 1 depicts certain components that are usable in an example implementation of an embodiment. For example, server 104, and clients 110, 112, 114, are depicted as servers and clients only as example and not to imply a limitation to a client-server architecture. As another example, an embodiment can be distributed across several conventional data processing systems, quantum data processing systems, and a data network as shown, whereas another embodiment can be implemented on a single conventional data processing system or single quantum data processing system within the scope of the illustrative embodiments. Conventional data processing systems 104, 110, 112, and 114 also represent example nodes in a cluster, partitions, and other configurations suitable for implementing an embodiment.

Device 132 is an example of a conventional computing device described herein. For example, device 132 can take the form of a smartphone, a tablet computer, a laptop computer, client 110 in a stationary or a portable form, a wearable computing device, or any other suitable device. Any software application described as executing in another conventional data processing system in FIG. 1 can be configured to execute in device 132 in a similar manner. Any data or information stored or produced in another conventional data processing system in FIG. 1 can be configured to be stored or produced in device 132 in a similar manner.

Server 104, storage unit 108, quantum processing system 140, and clients 110, 112, and 114, and device 132 may couple to network 102 using wired connections, wireless communication protocols, or other suitable data connectivity. Clients 110, 112, and 114 may be, for example, personal computers or network computers.

In the depicted example, server 104 may provide data, such as boot files, operating system images, and applications to clients 110, 112, and 114. Clients 110, 112, and 114 may be clients to server 104 in this example. Clients 110, 112, 114, or some combination thereof, may include their own data, boot files, operating system images, and applications. Data processing environment 100 may include additional servers, clients, and other devices that are not shown.

In the depicted example, memory 144 may provide data, such as boot files, operating system images, and applications to quantum processor 142. Quantum processor 142 may include its own data, boot files, operating system images, and applications. Data processing environment 100 may include additional memories, quantum processors, and other devices that are not shown. Memory 144 may include an application 107 that may be configured to implement one or more of the functions described herein for automatic quantum searching of object databases in accordance with one or more embodiments. Server 104 includes application 105 that may be configured to implement one or more of the functions described herein for automatic quantum searching of object databases in accordance with one or more embodiments.

In the depicted example, data processing environment 100 may be the Internet. Network 102 may represent a collection of networks and gateways that use the Transmission Control Protocol/Internet Protocol (TCP/IP) and other protocols to communicate with one another. At the heart of the Internet is a backbone of data communication links between major nodes or host computers, including thousands of commercial, governmental, educational, and other computer systems that route data and messages. Of course, data processing environment 100 also may be implemented as a number of different types of networks, such as for example, an intranet, a local area network (LAN), or a wide area network (WAN). FIG. 1 is intended as an example, and not as an architectural limitation for the different illustrative embodiments.

Among other uses, data processing environment 100 may be used for implementing a client-server environment in which the illustrative embodiments may be implemented. A client-server environment enables software applications and data to be distributed across a network such that an application functions by using the interactivity between a conventional client data processing system and a conventional server data processing system. Data processing environment 100 may also employ a service oriented architecture where interoperable software components distributed across a network may be packaged together as coherent business applications. Data processing environment 100 may also take the form of a cloud, and employ a cloud computing model of service delivery for enabling convenient, on-demand network access to a shared pool of configurable computing resources (e.g. networks, network bandwidth, servers, processing, memory, storage, applications, virtual machines, and services) that can be rapidly provisioned and released with minimal management effort or interaction with a provider of the service.

With reference to FIG. 2, this figure depicts a block diagram of a data processing system in which illustrative embodiments may be implemented. Data processing system 200 is an example of a conventional computer, such as servers 104 and 106, or clients 110, 112, and 114 in FIG. 1, or another type of device in which computer usable program code or instructions implementing the processes may be located for the illustrative embodiments.

Data processing system 200 is also representative of a conventional data processing system or a configuration therein, such as conventional data processing system 132 in FIG. 1 in which computer usable program code or instructions implementing the processes of the illustrative embodiments may be located. Data processing system 200 is described as a computer only as an example, without being limited thereto. Implementations in the form of other devices, such as device 132 in FIG. 1, may modify data processing system 200, such as by adding a touch interface, and even eliminate certain depicted components from data processing system 200 without departing from the general description of the operations and functions of data processing system 200 described herein.

In the depicted example, data processing system 200 employs a hub architecture including North Bridge and memory controller hub (NB/MCH) 202 and South Bridge and input/output (I/O) controller hub (SB/ICH) 204. Processing unit 206, main memory 208, and graphics processor 210 are coupled to North Bridge and memory controller hub (NB/MCH) 202. Processing unit 206 may contain one or more processors and may be implemented using one or more heterogeneous processor systems. Processing unit 206 may be a multi-core processor. Graphics processor 210 may be coupled to NB/MCH 202 through an accelerated graphics port (AGP) in certain implementations.

In the depicted example, local area network (LAN) adapter 212 is coupled to South Bridge and I/O controller hub (SB/ICH) 204. Audio adapter 216, keyboard and mouse adapter 220, modem 222, read only memory (ROM) 224, universal serial bus (USB) and other ports 232, and PCI/PCIe devices 234 are coupled to South Bridge and I/O controller hub 204 through bus 238. Hard disk drive (HDD) or solid-state drive (SSD) 226 and CD-ROM 230 are coupled to South Bridge and I/O controller hub 204 through bus 240. PCI/PCIe devices 234 may include, for example, Ethernet adapters, add-in cards, and PC cards for notebook computers. PCI uses a card bus controller, while PCIe does not. ROM 224 may be, for example, a flash binary input/output system (BIOS). Hard disk drive 226 and CD-ROM 230 may use, for example, an integrated drive electronics (IDE), serial advanced technology attachment (SATA) interface, or variants such as external-SATA (eSATA) and micro-SATA (mSATA). A super I/O (SIO) device 236 may be coupled to South Bridge and I/O controller hub (SB/ICH) 204 through bus 238.

Memories, such as main memory 208, ROM 224, or flash memory (not shown), are some examples of computer usable storage devices. Hard disk drive or solid state drive 226, CD-ROM 230, and other similarly usable devices are some examples of computer usable storage devices including a computer usable storage medium.

An operating system runs on processing unit 206. The operating system coordinates and provides control of various components within data processing system 200 in FIG. 2. The operating system may be a commercially available operating system for any type of computing platform, including but not limited to server systems, personal computers, and mobile devices. An object oriented or other type of programming system may operate in conjunction with the operating system and provide calls to the operating system from programs or applications executing on data processing system 200.

Instructions for the operating system, the object-oriented programming system, and applications or programs, such as application 105 in FIG. 1, are located on storage devices, such as in the form of code 226A on hard disk drive 226, and may be loaded into at least one of one or more memories, such as main memory 208, for execution by processing unit 206. The processes of the illustrative embodiments may be performed by processing unit 206 using computer implemented instructions, which may be located in a memory, such as, for example, main memory 208, read only memory 224, or in one or more peripheral devices.

Furthermore, in one case, code 226A may be downloaded over network 201A from remote system 201B, where similar code 201C is stored on a storage device 201D. in another case, code 226A may be downloaded over network 201A to remote system 201B, where downloaded code 201C is stored on a storage device 201D.

The hardware in FIGS. 1-2 may vary depending on the implementation. Other internal hardware or peripheral devices, such as flash memory, equivalent non-volatile memory, or optical disk drives and the like, may be used in addition to or in place of the hardware depicted in FIGS. 1-2. In addition, the processes of the illustrative embodiments may be applied to a multiprocessor data processing system.

In some illustrative examples, data processing system 200 may be a personal digital assistant (PDA), which is generally configured with flash memory to provide non-volatile memory for storing operating system files and/or user-generated data. A bus system may comprise one or more buses, such as a system bus, an I/O bus, and a PCI bus. Of course, the bus system may be implemented using any type of communications fabric or architecture that provides for a transfer of data between different components or devices attached to the fabric or architecture.

A communications unit may include one or more devices used to transmit and receive data, such as a modem or a network adapter. A memory may be, for example, main memory 208 or a cache, such as the cache found in North Bridge and memory controller hub 202. A processing unit may include one or more processors or CPUs.

The depicted examples in FIGS. 1-2 and above-described examples are not meant to imply architectural limitations. For example, data processing system 200 also may be a tablet computer, laptop computer, or telephone device in addition to taking the form of a mobile or wearable device.

Where a computer or data processing system is described as a virtual machine, a virtual device, or a virtual component, the virtual machine, virtual device, or the virtual component operates in the manner of data processing system 200 using virtualized manifestation of some or all components depicted in data processing system 200. For example, in a virtual machine, virtual device, or virtual component, processing unit 206 is manifested as a virtualized instance of all or some number of hardware processing units 206 available in a host data processing system, main memory 208 is manifested as a virtualized instance of all or some portion of main memory 208 that may be available in the host data processing system, and disk 226 is manifested as a virtualized instance of all or some portion of disk 226 that may be available in the host data processing system. The host data processing system in such cases is represented by data processing system 200.

With reference to FIG. 3, this figure depicts a block diagram of an example configuration 300 for automatic quantum searching of object databases. The example embodiment includes an application 302. In a particular embodiment, application 302 is an example of applications 105, 107 of FIG. 1.

Application 302 receives an object target which represents a unique object to be searched for in an object database 320. Application 302 includes a quantum search component 304 and a classical search (verification) component 306.

Quantum search component 304 includes a search criterion component 308, a stop criterion component 310, and an iteration value component 312. Quantum search component 304 is configured to search object database 320 for a location of object target 318. Component 308 receives a search criterion corresponding to the target object (unique item) in the object database 320. Component 308 performs search operation 322 to produce search result 324. Search operation 322 includes a first plurality of amplitude amplifications for an amplitude of a state of a quantum circuit. The amplitude of the state corresponds to a first location in the object database 320. Stop criterion component 310 determines when to terminate the search operation 322. In an embodiment, a user specifies a number of iterations of amplitude amplifications to perform on the amplitude. In an embodiment, component 310 measures the amplitude of the state after performing the plurality of amplitude amplifications. In response to stop criterion component 310 ending the search operation, search result 324 is returned. In an embodiment, search result 324 corresponds to a measurement of the amplitude, the amplitude corresponding to the first location in the object database 320. In an embodiment, search result 324 returns the object in the first location.

Classical search (verification) component 306 verifies the object target 318 in the first location. For example, search criterion component 314 can compare the object target 318 with the returned object in the first location. In response to verifying the returned object is the object target 318, stop criterion component 316 returns the location of the returned object and ends application 302. In response to failing to verify the returned object as the object target 318, iteration value 312 increments the plurality of amplitude amplifications to generate a new plurality of amplitude amplifications. Quantum search component 304 performs a second search operation 326 with the new plurality of amplitude amplifications. Second search operation 326 returns second search result 328 in response to reaching a stop criterion of the stop criterion component 310. Stop criterion component 310 measures a second amplitude of a second state of the quantum circuit, the second amplitude corresponding to a second location in the object database. In an embodiment, stop criterion component 310 ends application 302 in response to a number of the amplitude amplifications reaching the square root of a number of objects in the object database 320.

Classical search component 306 verifies the object target 318 in the second location. For example, search criterion component 314 can compare the object target 318 with the returned object in the second location. In response to verifying the returned object is the object target 318, stop criterion component 316 returns the second location of the returned object and ends application 302.

With reference to FIG. 4, this figure depicts a block diagram of an example configuration for automatic quantum searching of object databases. The example embodiment includes an application 402. In a particular embodiment, application 402 is an example of applications 105, 107 of FIG. 1.

Application 402 receives a quantum algorithm 412. Application 402 includes a compiler component 404. Component 404 includes a circuit transformation component 406, a quantum gate parameter analysis component 408, and an inverter component 410. Circuit transformation component 406 transforms the received quantum algorithm 412 from a set of programming code to a generated quantum circuit 414. In an embodiment, quantum algorithm 412 is a searching algorithm. Quantum gate parameter analysis component 408 analyzes a set of qubits of quantum processor 416. A set of qubit parameters 418 is returned in response to the analysis. In an embodiment, each qubit corresponds to a subset of the set of qubit parameters 418. Inverter component 410 generates an inverted quantum circuit 420 from the quantum circuit 414. In an embodiment, component 410 generates circuit 420 using two-qubit controlled not gates and one-qubit rotation gates. An embodiment configures inverted quantum circuit 420 to perform an amplitude amplification process as described herein.

With reference to FIG. 5, this figure depicts a flowchart of an example process 500 for automatic quantum searching of object databases in accordance with an illustrative embodiment. Example process 500 may be performed by application 302 in FIG. 3. In block 502, application 302 executes a first search operation with a first set of search commands to return a target object in an object database. In an embodiment, application 302 measures an amplitude of a state of a quantum circuit, after executing the first search operation. In an embodiment, the amplitude corresponds to a first location in an object database.

In block 504, application 302 executes, using a classical processor and a first memory, a second search (verification) operation, responsive to measuring the amplitude, to verify a target object in the first location. In block 506, application 302 executes a third search operation with a second set of search commands in response to failing to return the target object. In an embodiment, application 302, re-measures a second amplitude of a second state of the quantum circuit. In an embodiment, the second amplitude has undergone a first plurality of amplitude amplifications. In an embodiment, the second amplitude corresponds to a second location in the object database. In an embodiment, the second location is verified as the target object. In an embodiment, a total number of the first plurality of amplitude amplifications is less than a square root of a set of objects in the object database. Application 302 ends process 500 thereafter.

With reference to FIG. 6, this figure depicts a flowchart of an example process for a search operation in accordance with an illustrative embodiment. Example process 600 may be performed by application 302 in FIG. 3. In an embodiment, example method 600 can be performed at the first search operation and the second search operation in blocks 502, 506, respectively. In block 602, application 302 receives a target object to search for in an object database.

In block 604, application 302 generates a set of amplitudes for a set of objects (locations) of the object database. In block 606, application 302 amplifies an amplitude of the target object location in the set of amplitudes. In block 608, application 302 determines if a stop criterion for the search operation is reached. If application 302 determines a stop criterion is not reached (“NO” path of block 608), application 302 returns to block 606 to perform another amplitude amplification. If application 302 determines a stop criterion is reached (“YES” path of block 608), application 302 ends process 600 thereafter.

The following definitions and abbreviations are to be used for the interpretation of the claims and the specification. As used herein, the terms “comprises,” “comprising,” “includes,” “including,” “has,” “having,” “contains” or “containing,” or any other variation thereof, are intended to cover a non-exclusive inclusion. For example, a composition, a mixture, process, method, article, or apparatus that comprises a list of elements is not necessarily limited to only those elements but can include other elements not expressly listed or inherent to such composition, mixture, process, method, article, or apparatus.

Additionally, the term “illustrative” is used herein to mean “serving as an example, instance or illustration.” Any embodiment or design described herein as “illustrative” is not necessarily to be construed as preferred or advantageous over other embodiments or designs. The terms “at least one” and “one or more” are understood to include any integer number greater than or equal to one, i.e. one, two, three, four, etc. The terms “a plurality” are understood to include any integer number greater than or equal to two, i.e. two, three, four, five, etc. The term “connection” can include an indirect “connection” and a direct “connection.”

References in the specification to “one embodiment,” “an embodiment,” “an example embodiment,” etc., indicate that the embodiment described can include a particular feature, structure, or characteristic, but every embodiment may or may not include the particular feature, structure, or characteristic. Moreover, such phrases are not necessarily referring to the same embodiment. Further, when a particular feature, structure, or characteristic is described in connection with an embodiment, it is submitted that it is within the knowledge of one skilled in the art to affect such feature, structure, or characteristic in connection with other embodiments whether or not explicitly described.

The terms “about,” “substantially,” “approximately,” and variations thereof, are intended to include the degree of error associated with measurement of the particular quantity based upon the equipment available at the time of filing the application. For example, “about” can include a range of ±8% or 5%, or 2% of a given value.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments described herein.

The descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments described herein.

Thus, a computer implemented method, system or apparatus, and computer program product are provided in the illustrative embodiments for managing participation in online communities and other related features, functions, or operations. Where an embodiment or a portion thereof is described with respect to a type of device, the computer implemented method, system or apparatus, the computer program product, or a portion thereof, are adapted or configured for use with a suitable and comparable manifestation of that type of device.

Where an embodiment is described as implemented in an application, the delivery of the application in a Software as a Service (SaaS) model is contemplated within the scope of the illustrative embodiments. In a SaaS model, the capability of the application implementing an embodiment is provided to a user by executing the application in a cloud infrastructure. The user can access the application using a variety of client devices through a thin client interface such as a web browser (e.g., web-based e-mail), or other light-weight client-applications. The user does not manage or control the underlying cloud infrastructure including the network, servers, operating systems, or the storage of the cloud infrastructure. In some cases, the user may not even manage or control the capabilities of the SaaS application. In some other cases, the SaaS implementation of the application may permit a possible exception of limited user-specific application configuration settings.

The present invention may be a system, a method, and/or a computer program product at any possible technical detail level of integration. The computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device. The computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. A non-exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disc read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing. A computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.

Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network. The network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. A network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.

Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, configuration data for integrated circuitry, or either source code or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C++, or the like, and procedural programming languages, such as the “C” programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider). In some embodiments, electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer readable program instructions.

These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks. These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.

The computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatus, or other device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s). In some alternative implementations, the functions noted in the blocks may occur out of the order noted in the Figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems that perform the specified functions or acts or carry out combinations of special purpose hardware and computer instructions. 

What is claimed is:
 1. A method comprising: executing, using a quantum processor and a second memory, a search operation comprising a first plurality of quantum amplification operations, a result of the first plurality of quantum amplification operations comprising an amplitude corresponding to a first location in an object database; executing, using a classical processor and a first memory, a verification operation, the verification operation comparing a target object with a first object, the first object stored in the first location; and executing, using the quantum processor and the second memory, responsive to the verification operation determining that the target object is different from the first object, a second search operation comprising a second plurality of quantum amplification operations, a result of the second plurality of quantum amplification operations comprising a second amplitude corresponding to a second location in the object database, and wherein a sum of the first plurality of quantum amplification operations and the second plurality of the quantum amplification operations is less than a square root of a set of objects in the object database.
 2. The method of claim 1, further comprising: executing, using the classical processor and the first memory, a second verification operation comparing the target object with a second object, the second object stored in the second location.
 3. The method of claim 2, further comprising: incrementing, responsive to the second verification operation determining that the target object is different from the second object, the second plurality of quantum amplification operations; and repeating, until a stop criterion is satisfied, a third search operation and a third verification operation, the third search operation comprising the incremented second plurality of quantum amplification operations.
 4. The method of claim 3, wherein the stop criterion comprises the earlier of a determination that the third verification operation is successful and a number of quantum amplification operations reaching a square root of the number of objects in the object database.
 5. The method of claim 1, further comprising: generating, prior to executing the search operation, a set of amplitudes, an amplitude in the set of amplitudes corresponding to a location in the object database.
 6. The method of claim 1, wherein the second plurality of quantum amplification operations comprises an incrementing of the first plurality of quantum amplification operations.
 7. The method of claim 1, wherein the search operation is performed using an inverted quantum circuit, the inverted quantum circuit generated from a quantum circuit using at least one two-qubit controlled not gate and at least one one-qubit rotation gate, the quantum circuit generated from a quantum algorithm.
 8. A computer usable program product comprising a computer-readable storage device, and program instructions stored on the storage device, the stored program instructions comprising: program instructions to execute, using a quantum processor and a second memory, a search operation comprising a first plurality of quantum amplification operations, a result of the first plurality of quantum amplification operations comprising an amplitude corresponding to a first location in an object database; program instructions to execute, using a classical processor and a first memory, a verification operation, the verification operation comparing a target object with a first object, the first object stored in the first location; and program instructions execute, using the quantum processor and the second memory, responsive to the verification operation determining that the target object is different from the first object, a second search operation comprising a second plurality of quantum amplification operations, a result of the second plurality of quantum amplification operations comprising a second amplitude corresponding to a second location in the object database, and wherein a sum of the first plurality of quantum amplification operations and the second plurality of the quantum amplification operations is less than a square root of a set of objects in the object database.
 9. The computer usable program product of claim 8, wherein the program instructions are stored in a computer readable storage device in a data processing system, and wherein the computer usable code is transferred over a network from a remote data processing system.
 10. The computer usable program product of claim 8, wherein the program instructions are stored in a computer readable storage device in a server data processing system, and wherein the computer usable code is downloaded over a network to a remote data processing system for use in a computer readable storage device associated with the remote data processing system.
 11. The computer usable program product of claim 8, the stored program instructions further comprising: program instructions to execute, using the classical processor and the first memory, a second verification operation comparing the target object with a second object, the second object stored in the second location.
 12. The computer usable program product of claim 11, the stored program instructions further comprising: program instructions to increment, responsive to the second verification operation determining that the target object is different from the second object, the second plurality of quantum amplification operations; and program instructions to repeat, until a stop criterion is satisfied, a third search operation and a third verification operation, the third search operation comprising the incremented second plurality of quantum amplification operations.
 13. The computer usable program product of claim 12, wherein the stop criterion comprises the earlier of a determination that the third verification operation is successful and a number of quantum amplification operations reaching a square root of the number of objects in the object database.
 14. The computer usable program product of claim 8, the stored program instructions further comprising: program instructions to generate, prior to executing the search operation, a set of amplitudes, an amplitude in the set of amplitudes corresponding to a location in the object database.
 15. The computer usable program product of claim 8, wherein the second plurality of quantum amplification operations comprises an incrementing of the first plurality of quantum amplification operations.
 16. The computer usable program product of claim 8, wherein the search operation is performed using an inverted quantum circuit, the inverted quantum circuit generated from a quantum circuit using at least one two-qubit controlled not gate and at least one one-qubit rotation gate, the quantum circuit generated from a quantum algorithm.
 17. A computer system comprising a quantum processor, a computer-readable memory, and a computer-readable storage device, and program instructions stored on the storage device for execution by the quantum processor via the memory, the stored program instructions comprising: program instructions to execute, using a quantum processor and a second memory, a search operation comprising a first plurality of quantum amplification operations, a result of the first plurality of quantum amplification operations comprising an amplitude corresponding to a first location in an object database; program instructions to execute, using a classical processor and a first memory, a verification operation, the verification operation comparing a target object with a first object, the first object stored in the first location; and program instructions execute, using the quantum processor and the second memory, responsive to the verification operation determining that the target object is different from the first object, a second search operation comprising a second plurality of quantum amplification operations, a result of the second plurality of quantum amplification operations comprising a second amplitude corresponding to a second location in the object database, and wherein a sum of the first plurality of quantum amplification operations and the second plurality of the quantum amplification operations is less than a square root of a set of objects in the object database.
 18. The computer system of claim 17, the stored program instructions further comprising: program instructions to execute, using the classical processor and the first memory, a second verification operation comparing the target object with a second object, the second object stored in the second location.
 19. The computer system of claim 17, the stored program instructions further comprising: program instructions to generate, prior to executing the search operation, a set of amplitudes, an amplitude in the set of amplitudes corresponding to a location in the object database.
 20. The computer system of claim 17, wherein the second plurality of quantum amplification operations comprises an incrementing of the first plurality of quantum amplification operations. 